Count of integers - HackerEarth Solution

 import math
t = int(input())

def is_prime(n):
    factors = 0
    for i in range(1, n+1, 1):
        if n % i == 0:
            factors += 1
    if factors == 2:
        return True
    return False


for i in range(t):
    x = int(input())
    s = list(map(int,  input().split()))
    count = 0
    last_prime = 1
    for j in range(len(s)):
        if is_prime(s[j]):
            count+=1
        else:
            continue
    print(count)